Symmetric skew balanced starters and complete balanced Howell rotations
نویسندگان
چکیده
منابع مشابه
The Existence of Symmetric Skew Balanced Starters for Odd Prime Powers
Strong starters and skew starters have been widely used in various combinatorial designs. In particular skew balanced starters and symmetric skew balanced starters are crucially used in the construction of completely balanced Howell rotations. Let n = 2mfc + 1 be an odd prime power where m > 2 and k is an odd number. The existence of symmetric skew balanced starters for GF(n) has been proved fo...
متن کاملFinding balanced skew partitions in perfect graphs
A graph G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one; and it is known that this is equivalent to being perfect, that is, that the chromatic number of every induced subgraph equals the size of its largest clique. A skew partition in G is a partition (A,B) of V (G) such that G[A] is not connected and G[B] is not connected; and it is balan...
متن کاملOn Symmetric and Antisymmetric Balanced Binary Sequences
Let X = (x1, . . . , xn) be a finite binary sequence of length n, i.e., xi = ±1 for all i. The derived sequence of X is the binary sequence ∂X = (x1x2, . . . , xn−1xn) of length n− 1, and the derived triangle of X is the collection ∆X of all derived sequences ∂X for 0 ≤ i ≤ n−1. We say that X is balanced if its derived triangle ∆X contains as many +1’s as −1’s. This concept was introduced by St...
متن کاملBalanced Min Cost Flow on Skew Symmetric Networks with Convex Costs
We consider the solution of matching problems with a convex cost function via a network flow algorithm. We review the general mapping between matching problems and flow problems on skew symmetric networks and revisit several results on optimality of network flows. We use these results to derive a balanced capacity scaling algorithm for matching problems with a linear cost function. The latter i...
متن کاملSplit and balanced colorings of complete graphs
An (r, n)-split coloring of a complete graph is an edge coloring with r colors under which the vertex set is partitionable into r parts so that for each i, part i does not contain K, in color i. This generalizes the notion of split graphs which correspond to (2, 2)-split colorings. The smallest N for which the complete graph Ks has a coloring which is not (r,n)-split is denoted by f,.(n). Balan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1982
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1982-0654840-8